On the Properties of GZ-Aggregates in Answer Set Programming
نویسندگان
چکیده
Gelfond and Zhang recently proposed a new stable model semantics based on Vicious Circle Principle in order to improve the interpretation of logic programs with aggregates. A detailed complexity analysis of coherence testing and cautious reasoning under the new semantics highlighted similarities and differences versus mainstream stable model semantics for aggregates, which eventually led to the design of compilation techniques for implementing the new semantics on top of existing ASP solvers.
منابع مشابه
Complexity and compilation of GZ-aggregates in answer set programming
Gelfond and Zhang recently proposed a new stable model semantics based on Vicious Circle Principle in order to improve the interpretation of logic programs with aggregates. The paper focuses on this proposal, and analyzes the complexity of both coherence testing and cautious reasoning under the new semantics. Some surprising results highlight similarities and differences versus mainstream stabl...
متن کاملGelfond-Zhang Aggregates as Propositional Formulas
We show that any ASP aggregate interpreted under Gelfond and Zhang’s (GZ) semantics can be replaced (under strong equivalence) by a propositional formula. Restricted to the original GZ syntax, the resulting formula is reducible to a disjunction of conjunctions of literals but the formulation is still applicable even when the syntax is extended to allow for arbitrary formulas (including nested a...
متن کاملOn Logic Programming with Aggregates
In this paper, we present a translational semantics for normal logic programs with aggregates. We propose two different translations of logic programs with aggregates into normal logic programs, whose answer set semantics is used to defined the semantics of the original programs. Differently from many of the earlier proposals in this area, our semantics does not impose any syntactic restriction...
متن کاملDeclarative and Computational Properties of Logic Programs with Aggregates
We investigate the properties of logic programs with aggregates. We mainly focus on programs with monotone and antimonotone aggregates (LPAm,a programs). We define a new notion of unfounded set for LPAm,a programs, and prove that it is a sound generalization of the standard notion of unfounded set for aggregate-free programs. We show that the answer sets of an LPAm,a program are precisely its u...
متن کاملNested Aggregates in Answer Sets: An Application to a Priori Optimization
We allow representing and reasoning in the presence of nested multiple aggregates over multiple variables and nested multiple aggregates over functions involving multiple variables in answer sets, precisely, in answer set optimization programming and in answer set programming. We show the applicability of the answer set optimization programming with nested multiple aggregates and the answer set...
متن کامل